Semi–preemptive routing on a line

On-line Network Routing

Throughput-Competitive On-Line Routing

We develop a framework that allows us to address the issues of admission control and routing in high-speed networks under the restriction that once a call is admitted and routed, it has to proceed to completion and no reroutings are allowed. The “no rerouting” restriction appears in all the proposals for future high-speed networks and stems from current hardware limitations, in particular the f...

On-Line Matching Routing on Trees

We examine on-line heap construction and on-line permutation routing on trees under the matching model. Let T be and n-node tree of maximum degree d. By providing on-line algorithms we prove that: 1. For a rooted tree of height h, on-line heap construction can be completed within (2d − 1)h routing steps. 2. For an arbitrary tree, on-line permutation routing can be completed within 4dn routing s...

Confidence - Based Q - Routing : an on - Line Adaptivenetwork Routing Algorithm

This paper describes and evaluates how confidence values can be used to improve the quality of exploration in Q-Routing for adaptive packet routing in communication networks. In Q-Routing each node in the network has a routing decision maker that adapts, on-line, to learn routing policies that can sustain high network loads and have low average packet delivery time. These decision makers mainta...

On-Line Routing in All-Optical Networks

The paper deals with on-line routing in WDM (wavelength division multiplexing) optical networks. A sequence of requests arrives over time, each is a pair of nodes to be connected by a path. The problem is to assign a wavelength and a path to each pair, so that no two paths sharing a link are assigned the same wavelength. The goal is to minimize the number of wavelengths used to establish all co...